Computing large matchings in planar graphs with fixed minimum degree
نویسندگان
چکیده
منابع مشابه
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
In this paper we present algorithms that compute large matchings in planar graphs with fixed minimum degree. The algorithms give a guarantee on the size of the computed matching and run in linear time. Thus they are faster than the best known algorithm for computing maximum matchings in general graphs and in planar graphs, which run in O( √ nm) and O(n) time, respectively. For the class of plan...
متن کاملMatchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for hypergraphs. We also prove several related results which guarantee the existence of almost perfect matchings in r-uniform hypergraphs of large minimum degree. Our bounds on the minimum degree are essentially best poss...
متن کاملPerfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a perfect matching in terms of a variant of the minimum degree. We prove that for every k ≥ 3 and sufficiently large n, a perfect matching exists in every n-vertex k-uniform hypergraph in which each set of k − 1 vertices ...
متن کاملLight edges in 1-planar graphs with prescribed minimum degree
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove that each 1-planar graph of minimum degree δ ≥ 4 contains an edge with degrees of its endvertices of type (4,≤ 13) or (5,≤ 9) or (6,≤ 8) or (7, 7). We also show that for δ ≥ 5 these bounds are best possible and that the list of edges is minimal (in the sense that, for each...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.06.012